Key data processing

ABSTRACT

A parent cryptographic key associated with a blockchain object is obtained. A number of parties (N) to share control over the blockchain object is obtained. N child cryptographic keys are generated based on the parent cryptographic key by applying a predetermined algorithm to the parent cryptographic key, wherein N is an integer greater than or equal to 2, and wherein the N child cryptographic keys are collectively configured to enable reconstruction of the parent cryptographic key.

CROSS REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. patent application Ser. No.17/063,126, filed Oct. 5, 2020, which is a continuation U.S. patentapplication Ser. No. 16/719,762, filed Dec. 18, 2019, now U.S. Pat. No.10,797,865, which is a continuation of U.S. patent application Ser. No.16/113,722, filed Aug. 27, 2018, now U.S. Pat. No. 10,873,449, whichclaims priority to Chinese Patent Application No. 201710747807.5, filedon Aug. 28, 2017, and each application is hereby incorporated byreference in its entirety.

TECHNICAL FIELD

Implementations of the present specification relate to the field ofblockchain data processing technologies, and in particular, to a keydata processing method and apparatus, and a server.

BACKGROUND

A blockchain is a distributed database. It is a chained data structureobtained by combining data blocks in chronological order. Cryptographicmethod is used to ensure that data cannot be tampered with or forged.Because the blockchain can effectively ensure data authenticity, it isapplied in more fields.

Generally, the data in the blockchain is signed and verified by using anasymmetric encryption method. A transaction initiator in the blockchaincan sign a transaction by using a private key, and a miner (a computingnode) can verify the transaction by using a public key of the initiator.If verification on the transaction succeeds, it can indicate that fundsused for the transaction belong to a normal asset owner, and informationabout the transaction is placed in a new block of the blockchain. In anasset transaction process of the blockchain, a private key is usuallyowned by a single party, for example, stored in a person's mobile phoneor computer. Therefore, it can be considered that ownership and controlrights of the assets belong to the party owning the private key.However, some assets in reality are shared by a plurality of persons,for example, real estate jointly owned by a couple, or a joint ventureinvestment. When assets need to be shared by a plurality of parties, theparties need to share the same private key. By using the private key,each sharing party can control and trade the assets, and can transferthe assets in the absence of the other people's knowledge. Consequently,there is a relatively high transaction risk. Therefore, a securer andmore reliable method for ensuring security of shared assets in theblockchain is urgently needed.

SUMMARY

Implementations of the present specification are intended to provide akey data processing method and apparatus, and a server. As such, thesame number of child keys based on the number of asset sharing partiescan be automatically generated, and an original key can be restored byusing the child keys during a transaction, effectively ensuring securityof asset sharing in a blockchain.

The key data processing method and apparatus, and the server provided inthe implementations of the present specification are implemented in thefollowing ways:

A key data processing method includes: obtaining an original key of ashared object in a blockchain, and determining the number of partiessharing the original key; and processing the original key by using apredetermined algorithm, to generate the same number of child keys asthat of parties sharing the original key, where the child keys are usedto restore the original key when the same number of child keys areobtained.

A key data processing apparatus includes: an original key informationacquisition module, configured to obtain an original key of a sharedobject in a blockchain, and determine the number of parties sharing theoriginal key; and a child key generation module, configured to processthe original key by using a predetermined algorithm, to generate thesame number of child keys as that of parties sharing the original key,where the child keys are used to restore the original key when the samenumber of child keys are obtained.

A key data processing apparatus, including a processor and a memoryconfigured to store an instruction that can be executed by theprocessor, where when executing the instruction, the processorimplements the following operations: obtaining an original key of ashared object in a blockchain, and determining the number of partiessharing the original key; and processing the original key by using apredetermined algorithm, to generate the same number of child keys asthat of parties sharing the original key, where the child keys are usedto restore the original key when the same number of child keys areobtained.

A server, including at least one processor and a memory configured tostore an instruction that can be executed by the processor, where whenexecuting the instruction, the processor implements the followingoperations: obtaining an original key of a shared object in ablockchain, and determining the number of parties sharing the originalkey; and processing the original key by using a predetermined algorithm,to generate the same number of child keys as that of parties sharing theoriginal key, where the child keys are used to restore the original keywhen the same number of child keys are obtained.

According to the key data processing method and apparatus, and theserver provided in the one or more implementations of the presentspecification, the original key can be split into the plurality of childkeys based on the number of parties sharing the original key of theshared object, such as assets or data, and the generated child keys canbe displayed to the corresponding asset sharing parties. When the sharedobject needs to be operated, each asset sharing party can provide achild key. Then the original key can be restored by using the childkeys, and corresponding operations such as signing and assettransactions can be performed. As such, in the implementations of thepresent specification, when assets in the blockchain are shared by aplurality of persons, any person can be effectively prevented fromoperating the assets in the absence of the other people's knowledge, soas to ensure security of a shared asset transaction in the blockchain.

BRIEF DESCRIPTION OF DRAWINGS

To describe the technical solutions in the implementations of thepresent specification or in the existing technology more clearly, thefollowing briefly introduces the accompanying drawings for describingthe implementations or the existing technology. Apparently, theaccompanying drawings in the following description merely show someimplementations of the present specification, and a person of ordinaryskill in the art can still derive other drawings from these accompanyingdrawings without creative efforts.

FIG. 1 is a flow diagram illustrating an example method for key dataprocessing, according to the present specification.

FIG. 2 is a flow diagram illustrating an example method, according toanother implementation of the present specification.

FIG. 3 is a flow diagram illustrating a process of generating a childkey, according to an implementation of the present specification.

FIG. 4 is a flow diagram illustrating an example method, according toanother implementation of the present specification.

FIG. 5 is a schematic diagram illustrating another process of generatinga child key based on a predetermined algorithm, according to the presentspecification.

FIG. 6 is a schematic structural diagram illustrating a module of a keydata processing apparatus, according to an implementation of the presentspecification.

FIG. 7 is a schematic structural diagram illustrating a module of a keydata processing apparatus, according to another implementation of thepresent specification.

FIG. 8 is a schematic structural diagram illustrating a child keygeneration module in the apparatus, according to an implementation ofthe present specification.

FIG. 9 is a schematic structural diagram illustrating a key dataprocessing apparatus, according to another implementation of the presentspecification.

FIG. 10 is a schematic structural diagram illustrating a child keygeneration module in the apparatus, according to another implementationof the present specification.

FIG. 11 is a schematic structural diagram illustrating a module using awallet application, according to an implementation of the presentspecification.

FIG. 12 is a schematic structural diagram illustrating a server forimplementing a method or apparatus, according to an implementation ofthe present specification.

FIG. 13 is a flowchart illustrating an example of a computer-implementedmethod for managing shared ownership in a block chain network, accordingto an implementation of the present disclosure.

DESCRIPTION OF IMPLEMENTATIONS

To make a person skilled in the art understand the technical solutionsin the present specification better, the following clearly andcomprehensively describes the technical solutions in one or moreimplementations of the present specification with reference to theaccompanying drawings in the one or more implementations of the presentspecification. Apparently, the described implementations are merely somebut not all of the implementations of the present specification. Allother implementations obtained by a person of ordinary skill in the artbased on the one or more implementations of the present specificationwithout creative efforts shall fall within the protection scope of theimplementations of the present specification.

Although the present specification provides a method operation step oran apparatus structure shown in the following implementations or theaccompanying drawings, the method or apparatus can include more or feweroperation steps or module units based on conventional or non-creativeefforts in the method or apparatus. In a step or structure that anecessary cause and effect relationship does not logically exist, asequence of executing these steps or a module structure of the apparatusis not limited to an execution sequence or a module structure shown inthe implementations or the accompanying drawings of the presentspecification. In an actual apparatus, server, or terminal productapplication, the method or the module structure can be performedsequentially or in parallel based on a method or a module structureshown in the implementations or the accompanying drawings (for example,a parallel processor or a multi-threaded processing environment, or evenan implementation environment including distributed processing andserver clustering).

A blockchain usually includes a plurality of blocks. The block is alogical data structure and can be used to store blockchain data. Theblockchain data can include data information generated by operationssuch as funds flowing and changing in the blockchain, and funds flowing,asset changing, etc. In the blockchain, a flow of funds, or a change ofassets can usually be referred to as a transaction. The assets in theblockchain described in some implementations of the presentspecification can include money, securities, and precious metals thatare stored in the blockchain in a form of electronic data. For example,a wallet function provided by some applications can store monetaryassets, and the assets in the wallet can be used for product purchasingor transferring.

The data in the blockchain can verify transaction validity throughasymmetric encryption. The asymmetric encryption usually includes apublic key and a private key; the public key can be made public, and theprivate key is not made public. The asymmetric encryption is one of themain tools for transaction verification in a blockchain assettransaction. A transaction party can sign a transaction by using aprivate key, and a verifier can verify the signature by using a publickey of the transaction party. If the verification succeeds, it canindicate that the transaction is from a real owner of the private keycorresponding to the public key, and the transaction is valid. Thetransaction can be placed in a new block of the blockchain. It can beseen from the previous process that the private key plays a veryimportant role in the blockchain asset transaction. When assets areshared by a plurality of persons, the assets involve interests of theplurality of persons. When asset sharing parties need to jointlyparticipate in an asset transaction, the one or more implementations ofthe present specification can effectively ensure operation security ofshared assets in the blockchain.

Specifically, an implementation process of the present solution isdescribed in the present specification by using a blockchain transactionof a wallet application as an implementation scenario. The wallet caninclude an application on a client or server side, and can usuallygenerate an asymmetric key to calculate a public key address, so as toimplement a blockchain asset transaction. When new assets are confirmedor an asset sharing party changes, the wallet can automaticallycalculate and generate child keys based on the number of asset sharingparties. The number of generated child keys is the same as the number ofthe asset sharing parties. These child keys can be sent to correspondingasset sharing parties, so that each asset sharing party owns one childkey. When an original private key is needed for an asset transaction,the original private key can be restored by using these child keys, anda transaction is initiated by a signature using the restored privatekey.

Certainly, in the implementations of the present specification, theshared object is not necessarily limited to the previous electronicmoney assets, and the original key is not limited to a private key inthe asymmetric encryption. The shared object can also include servicedata of a corresponding type in another implementation scenario, forexample, billing data, user data, public information, etc. The originalkey can also include other data information for data encryption, forexample, a character string, or even key data such as an image, a voice,and a fingerprint. In the following implementation, the process ofgenerating the plurality of child keys based on the original key andrestoring the original key by using the received child keys can also becompleted by a miner in the blockchain through calculation. The miner isusually a node having enough computing capability. The miner can place aplurality of collected transaction records together, try various paddingbits for encryption by using a key of the miner, and broadcast the blockto the entire network, so that other nodes can learn that a new block isgenerated in the blockchain.

Specifically, an implementation is shown in FIG. 1. In an implementationof a key data processing method provided in the present specification,the method can include the following steps.

S0. Obtain an original key of a shared object in a blockchain, anddetermine the number of parties sharing the original key.

S2. Process the original key by using a predetermined algorithm, togenerate the same number of child keys as that of parties sharing theoriginal key, where the child keys are used to restore the original keywhen the same number of child keys are obtained.

In the present implementation, a calculation apparatus can obtaininformation about an original key corresponding to assets andinformation about the number of parties sharing the assets. Then, theoriginal key can be calculated and processed by using the predeterminedalgorithm selected or designed in advance, to generate the same numberof child keys as that of parties sharing the assets. A shared objectdescribed in an implementation scenario of the present implementationcan include assets in a wallet. The original key can be generated by alocal wallet (server), or can be a received original key sent by anotherwallet (server). In the present implementation, by using each of theplurality of child keys generated based on the original key, transactionverification cannot be independently performed, or verification cannotsucceed. When all child keys generated based on the same original keyare collected together, the original key can be restored. If a child keyis absent or any child key is incorrect, the original key cannot berestored, or the restored original key is incorrect.

For example, in an application scenario of the present implementation, ablockchain network can include a plurality of nodes, and each node canhave a public key and a private key. Assume that there is a walletapplication in a node, the wallet is the shared object in the presentimplementation, and the private key of the wallet is the original key.The private key of the wallet can be named S, and the number of walletsharing persons is 2. Two child keys: S1 and S2 can be generated basedon the private key S using the algorithm selected or designed inadvance. The child key S1 in the wallet cannot sign the transaction, orthe signature cannot be successfully verified. Likewise, the child keyS2 in the wallet cannot sign the transaction, or the signature cannot besuccessfully verified. However, an original private key S can berestored based on the child key S1 and the child key S2. To restore theoriginal private key S, corresponding calculations can be performed. Thecalculation is based on the predetermined algorithm used to generate thechild key, for example, a reverse algorithm opposite to thepredetermined algorithm for generating the child key. Certainly, thecalculation can be based on other algorithms such as interpolation andchild key correlation. The original key can also be restored withreference to third-party auxiliary data.

Further, in another implementation of the method provided in the presentspecification, after the same number of child keys as that of assetsharing parties are generated, the child keys can be displayed tocorresponding asset sharing parties, so that each asset sharing partycan obtain its own child key. Then, the original key can be deleted. Forexample, the original private key can be completely deleted from thewallet (or a storage unit storing the original private key). As such,any asset sharing party having a child key does not store the originalkey, to further ensure key data security, and prevent an asset sharingparty from using the private key for an asset transaction privately.Specifically, another implementation of the method in the presentspecification is shown in FIG. 2, and the method can further include thefollowing steps:

S4. Send the child keys to corresponding object sharing parties.

S6. Delete the original key.

FIG. 2 is a flow diagram illustrating an example method, according toanother implementation of the present specification. In the presentimplementation, after generating the public key and the private key, thewallet can generate the same number of child keys as that of sharingpersons based on the private key, display the child keys to the assetsharing parties, and delete the private key. In a specificimplementation process, it can be set that one child key is sent to oneasset sharing party. Certainly, this disclosure does not excludesituations where one asset sharing party has two or more child keys. Forexample, mutually trusted asset sharing parties can store each other'schild keys.

In an implementation, the child key can be sent by the wallet to theobject sharing party. In another implementation, after generating thechild keys, the wallet outputs the plurality of generated child keys,and then another processing party (for example, a dedicated child keyallocation apparatus) sends the child keys to the object sharingparties. A generated child key can be randomly selected and sent, or aspecified child key can be selected based on a certain rule and sent toa corresponding object sharing party.

The predetermined algorithm for generating the child keys in theprevious implementation can be implemented in a plurality ofimplementations. An implementation of the present specification providesa predetermined algorithm for generating a child key by using anoriginal key. An operation can be performed with reference to theoriginal key by using a random character string, to generate the childkeys. Specifically, in an implementation of the method in the presentspecification, the predetermined algorithm can include the followingstep:

S20. Perform an operation on the original key by using a randomlygenerated character string, to generate the same number of child keys asthat of parties sharing the original key.

The character string can include numerals, letters, symbols, etc. Thewallet can store these randomly generated character strings forsubsequent restoration of the original key. A specific method for theoperation on the original key by using the randomly generated characterstring can be predetermined. For example, a character string of a fixedlength is randomly generated, and one or more characters of thecharacter string are separately inserted in the original key in acertain sequence to generate the child keys. The values of correspondingbits of the character string can also be added to the original key. Inthe present implementation, the child keys of the original key aregenerated by using the random character string, so as to further ensuresecurity of the generated child keys, and improve security of theoriginal key.

In another implementation of the method of the present specification,child keys are generated by using a random number, a prime number, and amodulo operation. Details are shown in FIG. 3. FIG. 3 is a flow diagramillustrating a process of generating the child keys, according to animplementation of the present specification. The predetermined algorithmcan include the following steps:

S200. When there are (N+1) sharing parties, generate N random numbersRi, where Ri is the i^(th) random number, and i∈[1, N].

S202. Determine a prime number P, where the prime number P is at leastgreater than any one of a value S of the original key and the randomnumber Ri, and Ri ranges from [0, P−1].

S204. Perform a modulo operation on P after (S+R₁X+R₂X²+R₃X³+ . . .+R_(N)X^(N)) is calculated, and select a value of X from [1, N+1], toobtain the (N+1) child keys, where N≥1, and X and N are integers.

Generally, the length of the generated private key in the asymmetric keyalgorithm used in the blockchain is usually 1024 bits or 2048 bits.Therefore, in a specific implementation process of an implementationscenario, the wallet can pre-store some known prime numbers greater than1024 bits or 2048 bits. In the present implementation, the pre-storedprime number can be used as data storage when the wallet generates thechild keys. Assume that the private key is named S, the wallet canselect the random number Ri based on the number of sharing persons. Tomeet a child key calculation condition, a prime number P that has lengthgreater than a length of the private key S or the random number Ri canbe selected. Further, a modulo operation can be performed on P by using(S+R₁X+R₂X²+R₃X³+ . . . +R_(N)X^(N)), to generate the child keys. Aspecific example can be shown as follows:

(1) If two persons share the assets, the generated child keys can berespectively: a child key 1: generated by performing a modulo operationon P by using (S+R); and a child key 2: generated by performing a modulooperation on P by using (S+2R).

(2) If three persons share the assets, the generated child keys can berespectively: a child key 1 generated by performing a modulo operationon P by using (S+R₁+R₂); a child key 2 generated by performing a modulooperation on P by using (S+2R₁+4R₂); and a child key 3 generated byperforming a modulo operation on P by using (S+3R₁+9R₂).

By analogy, if (N+1) persons share the assets, (N+1) child keys need tobe generated, and a modulo operation can be performed on P by using(S+R₁X+R₂X²+R₃X³+ . . . +R_(N)X^(N)). The child keys can be obtainedthrough calculation by selecting values of X from [1, N+1]. In anotherexample, a process of generating four child keys by using the previousmethod when four persons share the assets can be as follows: a child key1, generated by performing a modulo operation on P by using(S+R₁+R₂+R₃); a child key 2, generated by performing a modulo operationon P by using (S+2R₁+4R₂+8R₃); a child key 3, generated by performing amodulo operation on P by using (S+3R₁+9R₂+27R₃); and a child key 4,generated by performing a modulo operation on P by using(S+4R₁+16R₂+64R₃).

According to the predetermined algorithm for calculating the child keysprovided in the present implementation, the same number of child keys asthat of parties sharing the original key can be automatically generatedbased on the number of parties sharing the original key by using apredetermined method of combining the random number, the prime number,and the modulo operation. Because the child key generation method isused, the generated child keys are more confidential, a risk that thechild keys are cracked is reduced, and the transaction is more secure.

In another implementation of the method provided in the presentspecification, the plurality of corresponding child keys can begenerated based on the original key of the shared object, and theoriginal key can further be restored based on the received child keys.Specifically, in another implementation of the method provided in thepresent specification, the method can further include the followingsteps:

S80. Receive entered child keys.

S82. When it is determined that the number of child keys is the same asthe number of parties sharing the corresponding original key, restore,through calculation, the original key based on the child keys by usingthe predetermined algorithm, to obtain the corresponding original key.

Certainly, the method can further include the following step:

S84: Operate the shared object by using the original key that isobtained after the restoration through calculation.

FIG. 4 is a flow diagram illustrating an example method, according toanother implementation of the present specification. When the originalkey is needed for an asset operation, each asset sharing party of theoriginal key can enter its own child key. Because the child keys aredistributed to the plurality of asset sharing parties, in the presentimplementation, the original key is restored when the same number ofchild keys as the number of parties sharing the original key arereceived. For example, the private key of the wallet generates threechild keys that are respectively stored by three wallet sharing persons.When a wallet funds operation needs to be performed, each wallet sharingperson enters its own child key. In the present situation, whenreceiving three child keys, the wallet can restore the private key ofthe wallet by using the three child keys. If the wallet receives onlyone or two child keys, or receives more than three child keys, it canindicate that the number of child keys is different from that of walletsharing persons, and the original key cannot be restored.

The original key can be restored based on the child keys with referenceto an algorithm corresponding to the algorithm for generating the childkeys or with reference to characteristics of the child keys by usingsome specific methods. For example, in the implementation of generatingthe child keys by using the random number, the prime number, and themodulo operation, in one or more processes of restoring the original keyin the present specification, the original private key S can be restoredby using a Lagrange equation.

After the restored original key is obtained, a corresponding sharedobject can be operated by using the key. For example, a transaction canbe signed to confirm that the transaction is generated by a userauthorized by the wallet. Further, the wallet can broadcast informationabout the signed transaction to a blockchain network, and store theinformation in a new block.

The previous implementation provides the predetermined algorithm forgenerating the child keys by using the random character string or therandom number, the prime number, etc. Another implementation of thepresent specification provides another implementation of generating acorresponding number of child keys based on the original key. In thepresent implementation, exclusive OR calculation can be performed on theoriginal key and each of random numbers that are generated at any time,where the random numbers have the same length The value obtained afterthe exclusive OR calculation and these random numbers are used as thechild keys. Specifically, in another implementation of the methodprovided in the present specification, the predetermined algorithm caninclude the following steps:

S210. Generate (N−1) random numbers, where binary lengths of the randomnumbers are the same as a binary length of the original key, and N isthe number of parties sharing the original key.

S212. Perform a bitwise exclusive OR operation on the original key andeach of the (N−1) random numbers, to obtain an exclusive OR child key.

S214. Use the exclusive OR child key and the (N−1) random numbers as Noutput child keys.

In the present implementation, if the shared object can generate the(N−1) random numbers in advance, the lengths of the random numbers canbe the same as the length of the original key, for example, binarynumbers of 1024 bits or 2048 bits. Exclusive OR calculation can beperformed on the original key and each of the (N−1) random numbers, toobtain a value. The value and the previously generated (N−1) randomnumbers are used as the child keys, and one child key is allocated toeach object sharing party.

A specific example of a processing method for performing a bitwiseexclusive OR operation on the original key and each of the randomnumbers is shown in FIG. 5. FIG. 5 is a schematic diagram illustratinganother process of generating the child keys based on a predeterminedalgorithm, according to the present specification. Assume that thelength of the original key S is 1024 bits in a binary system, and thenumber of parties sharing the original key is 4. Accordingly, threerandom binary numbers of 1024 bits can be generated first. Then, anexclusive OR operation can be performed on the original key S and thefirst random number to obtain R1, and then an exclusive OR operation isperformed on R1 and the second random number to obtain R2. Eventually,an exclusive OR operation is performed on R2 and the third random numberto obtain R3, and R3 is the exclusive OR child key in the presentimplementation. R3 and the three random binary numbers of 1024 bits areused as the four child keys obtained through calculation. When theoriginal key needs to be restored, a reverse exclusive OR operation canbe performed on the child keys obtained by performing the exclusive ORoperation in the present implementation. An exclusive OR operation isused during encryption, and an inverse operation of the exclusive ORoperation is performed during decryption. As such, the original key canbe obtained. The exclusive OR operation method provided in the presentimplementation is used to ensure that all correct child keys need to becollected during decryption, and the original key can be quicklyobtained by performing an exclusive OR operation on the child keys. Assuch, the key is easier to restore, and a processing speed of restoringthe original key during decryption is increased while ensuring assettransaction security.

The implementations in the present specification are described in aprogressive way, for same or similar parts in the implementations,reference can be made to these implementations, and each implementationfocuses on a difference from other implementations. For details,reference can be made to the descriptions in the previous relatedprocessing and related implementations. Details are not described here.

Specific implementations of the present specification are describedabove. Other implementations fall within the scope of the appendedclaims. In some situations, the actions or steps recorded in the claimscan be performed in a sequence different from that in theimplementations and a desired result can still be achieved. In addition,the process depicted in the accompanying drawings does not necessarilyneed a specific sequence or a consecutive sequence to achieve thedesired result. In some implementations, multitask processing andparallel processing can be feasible or can be advantageous.

According to the key data processing method provided in the one or moreimplementations of the present specification, the original key can besplit into the plurality of child keys based on the number of partiessharing the original key of the shared object such as assets or data,and the generated child keys can be displayed to the corresponding assetsharing parties. When the shared object needs to be operated, each assetsharing party can provide a child key. Then the original key can berestored by using the child keys, and corresponding operations such assigning and asset transactions can be performed. As such, in the presentimplementation of the present specification, when the assets in theblockchain are shared by a plurality of persons, any person can beeffectively prevented from operating the assets in the absence of theother people's knowledge, to ensure security of a shared assettransaction in the blockchain.

Based on the previous user key data processing method, one or moreimplementations of the present specification further provide a key dataprocessing apparatus. The apparatus can include an apparatus withnecessary implementation hardware and using a system (including adistributed system), software (an application), a module, a component, aserver, a client, etc. of the method in the implementations of thepresent specification. Based on a same innovative concept, the apparatusprovided in the one or more implementations of the present specificationis described in the following implementation. Because aproblem-resolving implementation solution of the apparatus is similar tothat of the method, for specific implementation of the apparatus in theimplementations of the present specification, reference can be made tothe implementation of the previous method. No repeated description isprovided. A term “unit” or “module” used in the followingimplementations can implement a combination of software and/or hardwareof a predetermined function. Although the apparatus described in thefollowing implementations is preferably implemented by software,implementation of hardware or a combination of software and hardware ispossible to conceive. Specifically, FIG. 6 is a schematic structuraldiagram illustrating a module of a key data processing apparatus,according to an implementation of the specification. As shown in FIG. 6,the apparatus can include an original key information acquisition module101 and a child key generation module 102. The original key informationacquisition module 101 is configured to obtain an original key of ashared object in a blockchain, and determine the number of partiessharing the original key. The child key generation module 102 isconfigured to process the original key by using a predeterminedalgorithm, to generate the same number of child keys as that of partiessharing the original key, where the child keys are used to restore theoriginal key when the same number of child keys are obtained.

According to the key data processing apparatus provided in the presentimplementation, the original key can be split into a plurality of childkeys based on the number of parties sharing the original key of theshared object such as assets or data. Each sharing person owns one childkey, so that when assets are shared by a plurality of persons, an assettransaction needs joint participation of the plurality of persons. Assuch, an asset sharing person can be effectively prevented fromoperating transaction data privately in a blockchain, to ensure securityof the asset transaction.

FIG. 7 is a schematic structural diagram illustrating a module of a keydata processing apparatus, according to another implementation of thepresent specification. In another implementation of the apparatus, theapparatus can further include: a child key output module 103, configuredto send the child keys to corresponding object sharing parties; and anoriginal key deletion module 104, configured to delete the original key.

In the present implementation, by using each of the plurality of childkeys generated based on the original key, transaction verificationcannot be independently performed, or verification cannot succeed. Whenall child keys generated by a same original key are collected together,the original key can be restored.

After the same number of child keys as that of asset sharing parties aregenerated, the child keys can be displayed to corresponding assetsharing parties, so that each asset sharing party can obtain a childkey. Then, the original key can be deleted. For example, the originalprivate key is completely deleted from a wallet. As such, any assetsharing party having a child key does not store the original key, tofurther ensure key data security, and prevent an asset sharing partyfrom privately using the private key for an asset transaction.

In another implementation of the apparatus, the predetermined algorithmused in the child key generation module 102 can include: performing anoperation on the original key by using a randomly generated characterstring, to generate the same number of child keys as that of partiessharing the original key.

Another implementation of the apparatus of the present specificationprovides an implementation of generating the child key by using a randomnumber, a prime number, and a modulo operation. FIG. 8 is a schematicstructural diagram illustrating a child key generation module in theapparatus, according to an implementation of the present specification.As shown in FIG. 8, the child key generation module 102 can include arandom number generation unit 1021, a prime number selection unit 1022,and a child key calculation unit 1023. The random number generation unit1021 is configured to: when there are (N+1) sharing parties, generate Nrandom numbers Ri, where Ri is the i^(th) random number, and i∈[1, N].The prime number selection unit 1022 is configured to determine a primenumber P, where the prime number P is at least greater than any one of avalue S of the original key and the random number Ri, and Ri ranges from[0, P−1]. The child key calculation unit 1023 is configured to: performa modulo operation on P after (S+R1X+R2X2+R3X3+ . . . +RNXN) iscalculated, and select a value of X from [1, N+1], to obtain the (N+1)child keys, where N≥1, and X and N are integers.

Based on the predetermined algorithm for calculating the child keysprovided in the present implementation and the number of parties sharingthe original key, the same number of child keys as that of partiessharing the original key can be automatically generated by using apredetermined method of combining the random number, the prime number,and the modulo operation. Because of the use of the above-mentionedchild key generation method, the child keys can be more securelygenerated, the risk that the child keys are cracked is reduced, and thetransaction is more secure.

In another implementation of the apparatus provided in the presentspecification, the plurality of corresponding child keys can begenerated based on the original key of the shared object, and theoriginal key can further be restored based on the received child keys.FIG. 9 is a schematic structural diagram illustrating a key dataprocessing apparatus, according to another implementation of the presentspecification. As shown in FIG. 9, the apparatus can further include areceiving module 1051 and an original key restoration module 1052. Thereceiving module 1051 is configured to receive entered child keys. Theoriginal key restoration module 1052 is configured to: when it isdetermined that the number of child keys is the same as the number ofparties sharing the corresponding original key, restore, throughcalculation, the original key based on the child keys by using thepredetermined algorithm, to obtain the corresponding original key.

FIG. 10 is a schematic structural diagram illustrating a child keygeneration module in the apparatus, according to another implementationof the present specification. As shown in FIG. 10, the child keygeneration module 102 can include a random number generation unit 20, anexclusive OR calculation unit 21, and a child key determining unit 22.The random number generation unit 20 is configured to generate (N−1)random numbers, where binary lengths of the random numbers are the sameas a binary length of the original key, and N is the number of partiessharing the original key. The exclusive OR calculation unit 21 isconfigured to perform a bitwise exclusive OR operation on the originalkey and each of the (N−1) random numbers, to obtain an exclusive ORchild key. The child key determining unit 22 is configured to use theexclusive OR child key and the (N−1) random numbers as N output childkeys.

In the present implementation, exclusive OR calculation can be performedon the original key and each of random numbers of the same lengthgenerated at any time, to obtain a value, and then the value obtainedafter the exclusive OR calculation and these random numbers are used aschild keys.

The exclusive OR operation method provided in the present implementationis used to ensure that all correct child keys need to be collectedduring decryption, and the original key can be quickly obtained byperforming an exclusive OR operation on the child keys. As such, the keyis easier to restore, and a processing speed of restoring the originalkey during decryption is greatly increased while ensuring assettransaction security.

It is worthwhile to note that the previous apparatus can further includeanother implementation based on the descriptions of the methodimplementation. For a specific implementation, reference can be made tothe descriptions in the related method implementation, and details arenot described here.

In the previous apparatus implementation, in an actual productapplication, each module or submodule can be combined or split based onan implementation environment or a data processing requirement. When theone or more implementations of the present specification areimplemented, the functions of each module can be implemented in one ormore pieces of software and/or hardware, or a module implementing a samefunction can be implemented by a combination of a plurality ofsubmodules or subunits. The described apparatus implementation is merelyan example. For example, the unit division is merely logical functiondivision and can be other division in actual implementation. Forexample, a plurality of units or components can be combined orintegrated into another system, or some features can be ignored or notperformed.

FIG. 11 is a schematic structural diagram illustrating a module using awallet application, according to an implementation of the presentspecification. As shown in FIG. 11, a public and private key generationcomponent of the wallet can generate a public key and a private key ofthe wallet. A prime number storage component pre-stores a plurality ofprime numbers whose lengths are greater than a length of the privatekey. A random number generation component can generate a correspondingnumber of random numbers when a child key needs to be generated. A childkey calculation unit can generate a plurality of child keyscorresponding to the private key, and output the child keys. The outputchild keys can be allocated to corresponding wallet sharing parties.When an asset transaction is performed on the wallet, each sharing partyenters a child key, a private key restoration calculation component cancalculate the original key based on a corresponding algorithm forrestoring an original key, and perform signature, verification, etc. onthe transaction by using the original key. After the transaction isgenerated, the transaction can be broadcast to the entire blockchainnetwork.

According to the key data processing apparatus provided in the one ormore implementations of the present specification, the original key canbe split into a plurality of child keys based on the number of partiessharing the original key of the shared object such as assets or data,and the generated child keys can be displayed to the corresponding assetsharing parties. When the shared object needs to be operated, each assetsharing party can provide a child key. Then the original key can berestored by using the child keys, and corresponding operations such assigning and asset transactions can be performed. As such, in the presentimplementation of the present specification, when the assets in theblockchain are shared by the plurality of persons, any person can beeffectively prevented from operating the assets in the absence of theother people's knowledge, so as to ensure security of a shared assettransaction in the blockchain.

The method or apparatus in the previous implementations of the presentspecification can implement service logic and record the service logicon a storage medium by using a computer program, and the storage mediumcan be read and executed by a computer, so as to implement the effectsof the solutions described in the present implementations of the presentspecification. The storage medium can include a physical apparatus forstoring information, which is generally digitized and then stored inmedia such as electric, magnetic, or optical. The storage medium caninclude an apparatus for storing information in an electric energy way,for example, a storage device such as a RAM or a ROM; an apparatus forstoring information in a magnetic energy way such as a hard disk, afloppy disk, a magnetic tape, a magnetic core memory, a magnetic bubblememory, or a USB flash drive; and an apparatus for storing informationin an optical way such as a CD or a DVD. Certainly, there is a readablestorage medium of another form such as a quantum memory or a graphenememory.

The user key data processing method or apparatus provided in theimplementations of the present specification can be implemented by aprocessor in a computer by executing a corresponding programinstruction, for example, implemented on a server by using c++Languagein a Windows operating system, on a server based on a Linux system, oron a server system terminal by using Android, iOS system programminglanguage, or implemented by using processing logic based on a quantumcomputer. The program instruction can be stored on the storage medium.In another implementation of the key data processing apparatus providedin the present specification, a processor and a memory configured tostore an instruction that can be executed by the processor can beincluded, and when executing the instruction, the processor implementsthe following operations: obtaining an original key of a shared objectin a blockchain, and determining the number of parties sharing theoriginal key; and processing the original key by using a predeterminedalgorithm, to generate the same number of child keys as that of partiessharing the original key, where the child keys are used to restore theoriginal key when the same number of child keys are obtained.

It is worthwhile to note that the previous apparatus can further includeanother implementation based on the description of the methodimplementation. For example, the processor deletes data of the originalkey, generates the child keys by using the random number, the primenumber, and the modulo operation, restores the original key by using aLagrange equation, generates the child keys by performing an exclusiveOR operation, and restores the original key by performing an inverseoperation. For a specific implementation, reference can be made to thedescriptions of the related method implementations, and details are notdescribed here.

The previous method or apparatus can be used in a plurality of serversfor key data processing, for example, a daemon server of the wallet, aserver of a miner node in a blockchain, and a service server of a nodein a blockchain. The server can include a separate server, or caninclude a server in a distributed system or an architectural pattern ofa server cluster. Specifically, the present specification provides aserver as shown in FIG. 12, the server can include at least oneprocessor and a memory configured to store an instruction that can beexecuted by the processor. When executing the instruction, the processorimplements the following operations: obtaining an original key of ashared object in a blockchain, and determining the number of partiessharing the original key; and processing the original key by using apredetermined algorithm, to generate the same number of child keys asthat of parties sharing the original key. When the number of obtainedchild keys are the same as the number of the parties sharing theoriginal key, the child keys can be used to restore the original key.

It is worthwhile to note that the previous server can further includeanother implementation based on the description of the method orapparatus implementation. For example, the processor deletes data of theoriginal key, generates the child key by using the random number, theprime number, and the modulo operation, restores the original key byusing a Lagrange formula, generates the child key by performing anexclusive OR operation, and restores the original key by performing aninverse operation. For a specific implementation, reference can be madeto the descriptions of the related method or apparatus implementations,and details are not described here.

The implementations in the present specification are all described in aprogressive way, for same or similar parts in the implementations,reference can be made to these implementations, and each implementationfocuses on a difference from other implementations. Especially, ahardware and program implementation is basically similar to a methodimplementation, and therefore is described briefly; for related parts,reference can be made to partial descriptions in the methodimplementation.

Specific implementations of the present specification are describedabove. Other implementations fall within the scope of the appendedclaims. In some situations, the actions or steps recorded in the claimscan be performed in a sequence different from that in theimplementations and a desired result can still be achieved. In addition,the process depicted in the accompanying drawings does not necessarilyneed a specific sequence or a consecutive sequence to achieve thedesired result. In some implementations, multitask processing andparallel processing can be feasible or can be advantageous.

According to the key data processing method and apparatus, and theserver provided in the one or more implementations of the presentspecification, the original key can be split into a plurality of childkeys based on the number of parties sharing the original key of theshared object such as assets or data, and the generated child keys canbe displayed to the corresponding asset sharing parties. When the sharedobject needs to be operated, each asset sharing party can provide achild key. Then the original key can be restored by using the childkeys, and corresponding operations such as signing and assettransactions can be performed. As such, in the present implementation ofthe present specification, when the assets in the blockchain are sharedby a plurality of persons, any person can be effectively prevented fromoperating the assets in the absence of the other people's knowledge, soas to ensure security of a shared asset transaction in the blockchain.

The content of the implementations of the present specificationdescribes data generation, definition, acquisition, interaction,calculation, determining, etc., for example, generating a child key byusing a random number, a prime number, and a modulo operation,generating a child key by using an exclusive OR operation, restoring anoriginal key by using a Lagrange equation, and deleting an originalprivate key after child key allocation. However, the implementations ofthe present specification are not limited to satisfying an industrycommunications standard, a blockchain data rule, standard computer dataprocessing and a storage rule, or situations described in the one ormore implementations of the present specification. A slightly modifiedimplementation solution obtained by using some industry standards, or ina self-defined way, or on a basis of described implementations can alsoimplement an implementation effect that is the same as, equivalent to,or similar to the described implementation, or an expectedimplementation effect obtained after transformation. The implementationsof obtaining, storing, determining, processing, etc. modified ordeformed data can still fall within the scope of the optionalimplementation solutions of the implementations of the presentspecification.

Specific implementations of the present specification are describedabove. Other implementations fall within the scope of the appendedclaims. In some situations, the actions or steps recorded in the claimscan be performed in a sequence different from that in theimplementations and a desired result can still be achieved. In addition,the process depicted in the accompanying drawings does not necessarilyneed a specific sequence or a consecutive sequence to achieve thedesired result. In some implementations, multitask processing andparallel processing can be feasible or can be advantageous.

In the 1990 s, whether technology improvement is hardware improvement(for example, improvement of a circuit structure, such as a diode, atransistor, or a switch) or software improvement (improvement of amethod procedure) can be obviously distinguished. However, astechnologies develop, improvement of many current method procedures canbe considered as direct improvement of a hardware circuit structure. Adesigner usually programs an improved method procedure to a hardwarecircuit to obtain a corresponding hardware circuit structure. Therefore,a hardware entity module can improve a method procedure. For example, aprogrammable logic device (PLD) (for example, a field programmable gatearray (FPGA)) is such an integrated circuit, and a logical function ofthe programmable logic device is determined by a user through deviceprogramming. The designer performs programming to “integrate” a digitalsystem to a PLD without requesting a chip manufacturer to design andproduce an application-specific integrated circuit chip. In addition,the programming is mostly implemented by modifying “logic compiler”software instead of manually making an integrated circuit chip. It issimilar to a software compiler used to develop and compose a program.However, original code obtained before compilation is also written in aspecific programming language, and it is referred to as hardwaredescription language (HDL). However, there are various HDLs, such as anAdvanced Boolean Expression Language (ABEL), an Altera HardwareDescription Language (AHDL), Confluence, a Cornell UniversityProgramming Language (CUPL), HDCal, a Java Hardware Description Language(JHDL), Lava, Lola, MyHDL, PALASM, and a Ruby Hardware DescriptionLanguage (RHDL). Currently, a Very-High-Speed Integrated CircuitHardware Description Language (VHDL) and Verilog are most popular. Aperson skilled in the art should also understand that, only logicprogramming needs to be performed on the method procedure by using thedescribed several hardware description languages, and the severalhardware description languages are programmed to an integrated circuit,so that a hardware circuit that implements the logical method procedurecan be easily obtained.

A controller can be implemented in any appropriate way. The controllercan use, for example, a microprocessor or a processor, and can storeforms of a computer-readable medium, a logic gate, a switch, anapplication-specific integrated circuit (ASIC), a programmable logiccontroller, and an embedded microcontroller that are ofcomputer-readable program code (for example, software or hardware) thatcan be executed by the (micro) processor. The controller includes but isnot limited to the following microcontrollers: ARC 625D, Atmel AT91SAM,Microchip PIC18F26K20, or Silicone Labs C8051F320. A memory controllercan also be implemented as a part of control logic of the memory. Aperson skilled in the art also knows that, in addition to implementingthe controller in a pure computer-readable program code way, logicprogramming can be completely performed by using the method step, sothat the controller implements a same function in a form of a logicalgate, a switch, an application-specific integrated circuit, aprogrammable logic controller, an embedded microcontroller, etc.Therefore, the controller can be considered as a hardware component, andan apparatus for implementing various functions in the controller canalso be considered as a structure in a hardware component.Alternatively, an apparatus configured to implement various functionscan be considered as a software module or a structure in a hardwarecomponent that can implement the method.

The system, apparatus, module, or unit described in the describedimplementations can be specifically implemented by a computer chip or anentity, or implemented by a product with a function. A typicalimplementation device is a computer. Specifically, the computer can be,for example, a personal computer, a laptop computer, a cellular phone, acamera phone, a smartphone, a personal digital assistant, a mediaplayer, a navigation device, an email device, a game console, a tabletcomputer, or a wearable device, or a combination of any of thesedevices.

Although the one or more implementations of the present specificationprovide the operation steps of the method according to an implementationor a flowchart, the conventional or non-creative means can include moreor fewer operation steps. The sequence of steps enumerated in theimplementations is merely one of a plurality of step executionsequences, and does not represent a unique execution sequence. In actualexecution of an apparatus or a terminal product, execution can beperformed based on a method sequence shown in the implementations or theaccompanying drawings, or performed in parallel (for example, a parallelprocessor or a multi-thread processing environment, or even adistributed data processing environment). Terms “include”, “contain”, ortheir any other variant is intended to cover non-exclusive inclusion, sothat a process, a method, an article, or a device that includes a seriesof elements not only includes these very elements, but also includesother elements which are not expressly listed, or further includeselements inherent to such process, method, article, or device. Anelement preceded by “includes a . . . ” does not, without moreconstraints, preclude the existence of additional identical elements inthe process, method, article, or device that includes the element.

For ease of description, the described apparatus is described bydividing functions into various units. Certainly, when the one or moreimplementations of the present specification are implemented, thefunctions of each module can be implemented in one or more pieces ofsoftware and/or hardware, or a module implementing a same function canbe implemented by a combination of a plurality of submodules orsubunits. The described apparatus implementation is merely an example.For example, the unit division is merely logical function division andcan be other division in actual implementation. For example, a pluralityof units or components can be combined or integrated into anothersystem, or some features can be ignored or not performed. In addition,the displayed or discussed mutual couplings or direct couplings orcommunication connections can be implemented by using some interfaces.The indirect couplings or communication connections between theapparatuses or units can be implemented in electronic, mechanical, orother forms.

A person skilled in the art also knows that, in addition to implementingthe controller in a pure computer-readable program code way, logicprogramming can be completely performed by using the method step, sothat the controller implements a same function in a form of a logicalgate, a switch, an application-specific integrated circuit, aprogrammable logic controller, an embedded microcontroller, etc.Therefore, the controller can be considered as a hardware component, andan apparatus for implementing various functions in the controller canalso be considered as a structure in a hardware component.Alternatively, an apparatus configured to implement various functionscan be considered as a software module or a structure in a hardwarecomponent that can implement the method.

The present disclosure is described with reference to the flowchartsand/or block diagrams of the method, the device (system), and thecomputer program product according to the implementations of the presentdisclosure. It should be understood that computer program instructionscan be used to implement each process and/or each block in theflowcharts and/or the block diagrams and a combination of a processand/or a block in the flowcharts and/or the block diagrams. Thesecomputer program instructions can be provided for a general-purposecomputer, a dedicated computer, an embedded processor, or a processor ofany other programmable data processing device to generate a machine, sothat the instructions executed by a computer or a processor of any otherprogrammable data processing device generate an apparatus forimplementing a specific function in one or more processes in theflowcharts or in one or more blocks in the block diagrams.

These computer program instructions can be stored in a computer-readablememory that can instruct the computer or any other programmable dataprocessing device to work in a specific way, so that the instructionsstored in the computer-readable memory generate an artifact thatincludes an instruction apparatus. The instruction apparatus implementsa specific function in one or more processes in the flowcharts and/or inone or more blocks in the block diagrams.

These computer program instructions can be loaded to a computer oranother programmable data processing device, so that a series ofoperations and steps are performed on the computer or the anotherprogrammable device, thereby generating computer-implemented processing.Therefore, the instructions executed on the computer or the anotherprogrammable device provide steps for implementing a specific functionin one or more processes in the flowcharts or in one or more blocks inthe block diagrams.

In typical configuration, the computing device includes one or moreprocessors (CPU), an input/output interface, a network interface, and amemory.

The memory can include a form of a volatile memory, a random accessmemory (RAM) and/or a non-volatile memory, etc. in a computer-readablemedium, such as a read-only memory (ROM) or a flash memory (flash RAM).The memory is an example of the computer-readable medium.

The computer-readable medium includes volatile and non-volatile,removable and non-removable media, and can store information by usingany method or technology. The information can be a computer-readableinstruction, a data structure, a program module, or other data. Acomputer storage medium includes but is not limited to a phase changerandom access memory (PRAM), a static random access memory (SRAM), adynamic random access memory (DRAM), a random access memory (RAM) ofanother type, a read-only memory (ROM), an electrically erasableprogrammable read-only memory (EEPROM), a flash memory or another memorytechnology, a compact disc read-only memory (CD-ROM), a digitalversatile disc (DVD) or another optical storage, a magnetic tape, amagnetic disk storage, another magnetic storage device, or any othernon-transmission medium. The computer storage medium can be used tostore information that can be accessed by the computing device Asdescribed in the present specification, the computer-readable mediumdoes not include transitory media, for example, a modulated data signaland a carrier.

A person skilled in the art should understand that the one or moreimplementations of the present specification can be provided as amethod, a system, or a computer program product. Therefore, the one ormore implementations of the present specification can use a form ofhardware only implementations, software only implementations, orimplementations with a combination of software and hardware. Inaddition, the one or more implementations of the present specificationcan use a form of a computer program product that is implemented on oneor more computer-usable storage media (including but not limited to adisk memory, a CD-ROM, an optical memory, etc.) that includecomputer-usable program code.

The one or more implementations of the present specification can bedescribed in common contexts of computer executable instructionsexecuted by a computer, such as a program module. Generally, the programmodule includes a routine, a program, an object, a component, a datastructure, etc. executing a specific task or implementing a specificabstract data type. The one or more implementations of the presentspecification can also be practiced in distributed computingenvironments. In these distributed computing environments, tasks areexecuted by remote processing devices that are connected by using acommunications network. In the distributed computing environments, theprogram module can be located in local and remote computer storage mediathat include storage devices.

The implementations in the present specification are all described in aprogressive way, for same or similar parts in the implementations,reference can be made to these implementations, and each implementationfocuses on a difference from other implementations. Especially, a systemimplementation is basically similar to a method implementation, andtherefore is described briefly; for related parts, reference can be madeto partial descriptions in the method implementation. In descriptions inthe present specification, descriptions about such reference terms as“an implementation”, “some implementations”, “an example”, “a specificexample”, and “some examples” mean that specific features, structures,materials, or characteristics described with reference to theimplementations or examples are included in at least one implementationor example of the present specification. In the present specification,the previous example expressions of the terms are not necessarily withrespect to a same implementation or example. In addition, the describedspecific features, structures, materials, or characteristics can becombined in a proper way in any one or more of the implementations orexamples. In addition, a person skilled in the art can integrate orcombine different implementations or examples and characteristics ofdifferent implementations or examples described in the presentspecification, provided that they do not conflict with each other.

The previous descriptions are merely implementations of the one or moreimplementations of the present specification, and are not intended tolimit the one or more implementations of the present specification. Fora person skilled in the art, the one or more implementations of thepresent specification can have various modifications and changes. Anymodifications, equivalent replacements, improvements, etc. made withinthe spirit and principle of the present application shall fall withinthe protection scope of the claims.

FIG. 13 is a flowchart illustrating an example of a computer-implementedmethod 1300 for managing shared ownership in a block chain network,according to an implementation of the present disclosure. For clarity ofpresentation, the description that follows generally describes method1300 in the context of the other figures in this description. However,it will be understood that method 1300 can be performed, for example, byany system, environment, software, and hardware, or a combination ofsystems, environments, software, and hardware, as appropriate. In someimplementations, various steps of method 1300 can be run in parallel, incombination, in loops, or in any order.

In a blockchain network, blockchain objects can represent various assetsor data to be tracked by or recorded the blockchain. The ownership of ablockchain object is typically associated with a public-private keypair, and establishing that a party is in possession of the private keyof the public-private key pair is used to show ownership of a blockchainobject. For example, the owner of a blockchain object can encrypt a hashof a blockchain object using the private key, which other parties candecrypt using the public key associated with the blockchain object toconfirm that the owner is in possession of the private key of thepublic-private key pair associated with the blockchain object, and hencethe owner of the object.

In general, assets may be jointly owned by two or more parties. Forexample, a house, a car, or a bank account may be jointly owned by twoor more parties. As such, an ability to jointly own a blockchain objectis desired. However, a typical blockchain network allows only a singlepublic-private key pair to be associated with a blockchain object, andmodifying the blockchain network architecture to allow for associationof multiple public-private key pair to an object may be infeasible. Assuch, there is a need for managing shared ownership of blockchainobjects in existing blockchain networks. Such shared ownership may beimplemented through generation of multiple child cryptographic keys fromthe private key (the “parent cryptographic key”) of the public-privatekey pair associated with the blockchain object, and distribution of thechild cryptographic keys to the joint owners of the object.

Individual child cryptographic keys are different from the parentcryptographic key, and therefore cannot be used to establish ownershipof a blockchain objet. However, when the joint owners each provide theirchild cryptographic key and when a complete set of child cryptographickeys are obtained, the parent cryptographic key can be reconstructedfrom the child cryptographic keys, which can in turn be used to provejoint ownership over the blockchain object and dispose the blockchainobject as agreed upon by all of the joint owners. Accordingly,joint-control over the blockchain object is established, in which theblockchain object can be controlled only when all of the joint ownershave provided their consent by providing their child cryptographic keys.

At 1302, a parent cryptographic key associated with a blockchain objectis obtained. This step may be similar to the step S0 of FIG. 1. Ablockchain object may be initially owned by a single owner at the timeof creation of the object, as the blockchain object is associated with asingle public-private key pair. When a group of parties wishes tojointly own the created blockchain object, or otherwise change ownershipof the blockchain object from sole ownership to shared or jointownership, the private key of the public-private key pair associatedwith the blockchain object is obtained. The private key may be obtained,for example, from the blockchain network at the time of creation of theblockchain object, or provided by the current owner of blockchainobject. In some implementations, an intermediary, such as a broker or anagent, may obtain the parent cryptographic key on behalf of theinterested parties to protect integrity of the ownership of theblockchain object until the child cryptographic keys are generated.

The private key of the public-private key pair is an example of theparent cryptographic key. The parent cryptographic key is typically aseries of bits of predetermined length that depends, for example, on thespecific encryption standard or technology. For example, the parentcryptographic key can have a bit-length of 128, 256, 384, 1024, 2048,3072 bits, or longer.

From 1302, method 1300 proceeds to 1304.

At 1304, a number of parties (N) to share control over the blockchainobject is obtained. N is an integer greater than or equal to 2. Prior togenerating the child cryptographic keys, the number of keys to begenerated is to be first obtained. For example, the parties establishingjoint ownership may provide the number of parties N to the blockchainnetwork, to the current owner of the blockchain object, or to anintermediary. This number of keys is typically the number of parties toshare control over the blockchain. The parties sharing control over theblockchain may be joint or shared owners of the blockchain object. Insome implementations, the parties sharing control can have capacitiesother than shared or joint owners of the blockchain object. For example,a party may be a trustee of an estate or a will, who may not own theblockchain object, but has control over how the blockchain object isdisposed.

From 1304, method 1300 proceeds to 1306.

At 1306, N child cryptographic keys based on the parent cryptographickey are generated by applying a predetermined algorithm to the parentcryptographic key. The N child cryptographic keys are collectivelyoperable to reconstruct the parent cryptographic key. This step may besimilar to the step S2 of FIG. 1. Generally, the child cryptographickeys should meet two criteria. First, individual child cryptographickeys should be different from the parent cryptographic key, so thatindividual child keys cannot be used to establish ownership. Further, itwould be advantageous for the generated child cryptographic keys todiffer from the parent cryptographic keys in ways that do notsubstantially reduce the level of security of the parent cryptographickeys. Second, the complete set of child cryptographic keys should allowfor deterministic reconstruction (e.g., not brute force) of the parentcryptographic key.

Once the parent cryptographic key and the number of parties N have beenobtained, N child cryptographic keys can be generated from the parentcryptographic key in various ways. In some implementations, the N childcryptographic keys are generated by applying the predetermined algorithmto the parent cryptographic key that comprises: generating N−1 randomnumbers R_(i), wherein i is an integer between 1 and N−1 and R_(i) is anon-negative integer; determining a prime number P greater than therandom numbers R_(i), the prime number P being greater than at least oneof a value S of the parent cryptographic key or the random numbersR_(i), and greater than the random numbers R_(i); and determining Nchild cryptographic keys Cx, wherein Cx=P modulo (S+R₁X+R₂X²+R₃X³+ . . .+R_(N-1)X^(N-1)) and X is an integer between 1 and N. The equation fordetermining the child cryptographic keys Cx may be rewritten in amathematically equivalent form as C_(X)=S+P mod Σ_(m=1)^(N-1)R_(m)X_(m).

In some implementations, the N child cryptographic keys are generated byapplying the predetermined algorithm to the parent cryptographic keythat comprises: generating N−1 random numbers having bit-lengths equalto a bit-length of the parent cryptographic key; and generating anexclusive OR (XOR) child cryptographic key by performing a series ofbitwise XOR operations, that comprises: performing an XOR operationbetween the parent cryptographic key and one of the N−1 random numbers;and sequentially performing XOR operations between an output of previousXOR operation and one of the remaining random numbers. The N−1 randomnumbers and the XOR child cryptographic key generated by the XORoperations can be used as the N child cryptographic keys.

In some implementations, the N child cryptographic keys are generated byapplying the predetermined algorithm to the parent cryptographic keythat comprises: modifying the parent cryptographic key based on arandomly generated character string. This step may be similar to stepS20 described previously. Portions of the randomly generated characterstring can be used to modify the parent cryptographic keys in differentways to generate different child cryptographic keys. For example, aspecific portion of the parent cryptographic key can be replaced with aspecific portion of the randomly generated character string to produce achild cryptographic key. Different portions of the parent cryptographickey can be replaced with different portions of the randomly generatedcharacter string to generate multiple child cryptographic keys. Thelocations and the lengths of the replaced portions in the parentcryptographic key and corresponding locations and lengths of therandomly generated character string may be determined according to apreset algorithm. The preset algorithm may vary the locations andlengths of the replaced portions in a random manner to improverobustness of the generated child cryptographic keys. The locations andlengths of the replaced portions may be shared among the parties holdingthe child cryptographic keys, for use during reconstruction of theparent cryptographic key from the child cryptographic keys. In someimplementations, in addition to replacement of different portions of theparent cryptographic keys with portions of the randomly generatedcharacter string, the bit-string resulting from the replacement canfurther be scrambled according to a preset algorithm to further improverobustness.

After 1306, method 1300 stops.

In some implementations of the method 1300, the method further includesthe steps of: transmitting the N child cryptographic keys tocorresponding parties; and deleting the parent cryptographic key. Bydeleting the parent cryptographic key, any possibility of a single partyobtaining the parent cryptographic key without reconstructing the parentcryptographic key from the complete set of child cryptographic keys isessentially eliminated, which improves the robustness of the sharedownership established through the child cryptographic keys. Further, incases where an intermediary is involved in generation of the childcryptographic keys, deleting the parent cryptographic key in theintermediary's possession can prevent potential unauthorized controlover the blockchain object by the intermediary. In some implementations,the method can further include the step of confirming that thetransmitted child cryptographic keys have been received by thecorresponding parties, and delete the parent cryptographic key when allparties have confirmed receipt of the child cryptographic keys.

Once the child cryptographic keys have been generated and transmitted tothe parties, and once the parent cryptographic key has been deleted, theblockchain object associated with the parent cryptographic key cannot becontrolled by any single party. When all of the shared or joint ownersof the blockchain object agree to sell or otherwise control theblockchain object, the parent cryptographic key needs to bereconstructed. The parent cryptographic key can be reconstructed fromthe complete set of child cryptographic keys based on a reconstructionalgorithm. As such, in some implementations of the method 1300, themethod further includes the steps of: receiving a plurality ofcryptographic keys; determining that a number of received plurality ofcryptographic keys is equal to the number of parties sharing controlover the blockchain object; and in response to determining that a numberof received plurality of cryptographic keys is equal to the number ofparties sharing control over the blockchain object, reconstructing theparent cryptographic key by applying a reconstruction algorithm to thereceived plurality of cryptographic keys. This step may be similar tostep S82 of FIG. 4.

The reconstruction algorithm generally differs based on thepredetermined algorithm for generating the child cryptographic keys. Forexample, the Lagrange's theorem or the Lagrange polynomial can beapplied to child cryptographic keys generated using the modulo operationto reconstruct the parent cryptographic key. As another example, forchild cryptographic keys generated using the XOR-based algorithm, theparent cryptographic key can be reconstructed using a series of XORoperations. Specifically, XOR operations can be performed between theXOR child cryptographic key and the random numbers in reverse order toreconstruct the parent cryptographic key. Due to the commutative andassociative nature of XOR operation, the reconstruction may also beperformed by performing a series of XOR operations between the XOR childcryptographic keys and the random numbers in any order. As such, in someimplementations of the method 1300, the method further includes thesteps of: receiving a plurality of cryptographic keys comprising the XORchild cryptographic key and the N−1 random numbers; determining that anumber of received plurality of cryptographic keys is equal to thenumber of parties sharing control over the blockchain object; and inresponse to determining that a number of received plurality ofcryptographic keys is equal to the number of parties sharing controlover the blockchain object, reconstructing the parent cryptographic keyby performing a series of bitwise XOR operations, comprising: performingan XOR operation between the XOR child cryptographic key and one of theN−1 random numbers; and sequentially performing XOR operations betweenan output of a previous XOR operation and one of the remaining randomnumbers.

The methods and apparatuses disclosed herein can improve blockchainnetworks by allowing shared or joint control over a blockchain object byseveral parties. Such joint control or ownership allows a blockchainnetwork to support asset ownership paradigms in conventional ledgers andrecordkeeping approaches. By generating child cryptographic keys from asingle parent cryptographic key, and reconstructing the parentcryptographic key from the child cryptographic keys, shared ownershipover blockchain objects can be established in existing blockchainnetworks without modifying the blockchain architecture. Further, bymodifying the parent cryptographic key using modulo-based or XOR-basedapproaches to generate the child cryptographic keys, resulting childcryptographic keys do not contain significant portions of the parentcryptographic key. Such child cryptographic keys improve security of theshared or joint ownership relative to, for example, an approach wherethe parent cryptographic keys are simply divided into portions andhanded out to the shared owners. Such division-based approach may besusceptible to brute force attempts by a majority, but not entirety, ofthe shared owners, as such group of shared owners possesses a largeportion of the parent cryptographic key, which significantly reduces thecomputational burden associated with a brute force attempt, andcompromises the shared control over the blockchain object.

Embodiments and the operations described in this specification can beimplemented in digital electronic circuitry, or in computer software,firmware, or hardware, including the structures disclosed in thisspecification or in combinations of one or more of them. The operationscan be implemented as operations performed by a data processingapparatus on data stored on one or more computer-readable storagedevices or received from other sources. A data processing apparatus,computer, or computing device may encompass apparatus, devices, andmachines for processing data, including by way of example a programmableprocessor, a computer, a system on a chip, or multiple ones, orcombinations, of the foregoing. The apparatus can include specialpurpose logic circuitry, for example, a central processing unit (CPU), afield programmable gate array (FPGA) or an application-specificintegrated circuit (ASIC). The apparatus can also include code thatcreates an execution environment for the computer program in question,for example, code that constitutes processor firmware, a protocol stack,a database management system, an operating system (for example anoperating system or a combination of operating systems), across-platform runtime environment, a virtual machine, or a combinationof one or more of them. The apparatus and execution environment canrealize various different computing model infrastructures, such as webservices, distributed computing and grid computing infrastructures.

A computer program (also known, for example, as a program, software,software application, software module, software unit, script, or code)can be written in any form of programming language, including compiledor interpreted languages, declarative or procedural languages, and itcan be deployed in any form, including as a stand-alone program or as amodule, component, subroutine, object, or other unit suitable for use ina computing environment. A program can be stored in a portion of a filethat holds other programs or data (for example, one or more scriptsstored in a markup language document), in a single file dedicated to theprogram in question, or in multiple coordinated files (for example,files that store one or more modules, sub-programs, or portions ofcode). A computer program can be executed on one computer or on multiplecomputers that are located at one site or distributed across multiplesites and interconnected by a communication network.

Processors for execution of a computer program include, by way ofexample, both general- and special-purpose microprocessors, and any oneor more processors of any kind of digital computer. Generally, aprocessor will receive instructions and data from a read-only memory ora random-access memory or both. The essential elements of a computer area processor for performing actions in accordance with instructions andone or more memory devices for storing instructions and data. Generally,a computer will also include, or be operatively coupled to receive datafrom or transfer data to, or both, one or more mass storage devices forstoring data. A computer can be embedded in another device, for example,a mobile device, a personal digital assistant (PDA), a game console, aGlobal Positioning System (GPS) receiver, or a portable storage device.Devices suitable for storing computer program instructions and datainclude non-volatile memory, media and memory devices, including, by wayof example, semiconductor memory devices, magnetic disks, andmagneto-optical disks. The processor and the memory can be supplementedby, or incorporated in, special-purpose logic circuitry.

Mobile devices can include handsets, user equipment (UE), mobiletelephones (for example, smartphones), tablets, wearable devices (forexample, smart watches and smart eyeglasses), implanted devices withinthe human body (for example, biosensors, cochlear implants), or othertypes of mobile devices. The mobile devices can communicate wirelessly(for example, using radio frequency (RF) signals) to variouscommunication networks (described below). The mobile devices can includesensors for determining characteristics of the mobile device's currentenvironment. The sensors can include cameras, microphones, proximitysensors, GPS sensors, motion sensors, accelerometers, ambient lightsensors, moisture sensors, gyroscopes, compasses, barometers,fingerprint sensors, facial recognition systems, RF sensors (forexample, Wi-Fi and cellular radios), thermal sensors, or other types ofsensors. For example, the cameras can include a forward- or rear-facingcamera with movable or fixed lenses, a flash, an image sensor, and animage processor. The camera can be a megapixel camera capable ofcapturing details for facial and/or iris recognition. The camera alongwith a data processor and authentication information stored in memory oraccessed remotely can form a facial recognition system. The facialrecognition system or one-or-more sensors, for example, microphones,motion sensors, accelerometers, GPS sensors, or RF sensors, can be usedfor user authentication.

To provide for interaction with a user, embodiments can be implementedon a computer having a display device and an input device, for example,a liquid crystal display (LCD) or organic light-emitting diode(OLED)/virtual-reality (VR)/augmented-reality (AR) display fordisplaying information to the user and a touchscreen, keyboard, and apointing device by which the user can provide input to the computer.Other kinds of devices can be used to provide for interaction with auser as well; for example, feedback provided to the user can be any formof sensory feedback, for example, visual feedback, auditory feedback, ortactile feedback; and input from the user can be received in any form,including acoustic, speech, or tactile input. In addition, a computercan interact with a user by sending documents to and receiving documentsfrom a device that is used by the user; for example, by sending webpages to a web browser on a user's client device in response to requestsreceived from the web browser.

Embodiments can be implemented using computing devices interconnected byany form or medium of wireline or wireless digital data communication(or combination thereof), for example, a communication network. Examplesof interconnected devices are a client and a server generally remotefrom each other that typically interact through a communication network.A client, for example, a mobile device, can carry out transactionsitself, with a server, or through a server, for example, performing buy,sell, pay, give, send, or loan transactions, or authorizing the same.Such transactions may be in real time such that an action and a responseare temporally proximate; for example an individual perceives the actionand the response occurring substantially simultaneously, the timedifference for a response following the individual's action is less than1 millisecond (ms) or less than 1 second (s), or the response is withoutintentional delay taking into account processing limitations of thesystem.

Examples of communication networks include a local area network (LAN), aradio access network (RAN), a metropolitan area network (MAN), and awide area network (WAN). The communication network can include all or aportion of the Internet, another communication network, or a combinationof communication networks. Information can be transmitted on thecommunication network according to various protocols and standards,including Long Term Evolution (LTE), 5G, IEEE 802, Internet Protocol(IP), or other protocols or combinations of protocols. The communicationnetwork can transmit voice, video, biometric, or authentication data, orother information between the connected computing devices.

Features described as separate implementations may be implemented, incombination, in a single implementation, while features described as asingle implementation may be implemented in multiple implementations,separately, or in any suitable sub-combination. Operations described andclaimed in a particular order should not be understood as requiring thatthe particular order, nor that all illustrated operations must beperformed (some operations can be optional). As appropriate,multitasking or parallel-processing (or a combination of multitaskingand parallel-processing) can be performed.

1.-20. (canceled)
 21. A computer-implemented method for processing keydata comprising: obtaining, by a server, an original key associated witha shared blockchain object; determining a first number of partiessharing the original key, wherein the first number is at least 2; andgenerating, by the server, a plurality of child keys based on theoriginal key by applying a predetermined algorithm to the original key,wherein a total number of child keys equals the first number of partiessharing the original key, and wherein the plurality of child keys arecollectively configured to enable reconstruction of the original key.22. The computer-implemented method according to claim 21, whereinapplying the predetermined algorithm comprises modifying the originalkey based on a randomly generated character string.
 23. Thecomputer-implemented method according to claim 21, wherein the methodcomprises: sending, by the server, each child key of the plurality ofchild keys to a different corresponding party of the first number ofparties sharing the original key; and deleting, by the server, theoriginal key.
 24. The computer-implemented method according to claim 23comprising restoring, by the server, the deleted original key based onthe plurality of child keys.
 25. The computer-implemented methodaccording to claim 24, wherein restoring the deleted original key basedon the plurality of child keys comprises using a reverse algorithm ofthe predetermined algorithm, an interpolation algorithm, a correlationamong the plurality of child keys, or third-party auxiliary data. 26.The computer-implemented method according to claim 21, wherein theoriginal key is generated by the server or is received from a remoteserver.
 27. The computer-implemented method according to claim 22,wherein the randomly generated character string comprises one or moreof: a numeral, a letter, and a symbol, and wherein the randomlygenerated character string is stored by the server for subsequentrestoration of the original key.
 28. The computer-implemented methodaccording to claim 22, wherein the randomly generated character stringcomprises a fixed length, and wherein generating, by the server, theplurality of child keys based on the original key by applying thepredetermined algorithm to the original key comprises: separatelyinserting one or more characters of the randomly generated characterstring in the original key in a predetermined sequence to generate theplurality of child keys.
 29. The computer-implemented method accordingto claim 22, wherein generating, by the server, the plurality of childkeys based on the original key by applying the predetermined algorithmto the original key comprises: replacing a different portion of theoriginal key with a corresponding portion of the randomly generatedcharacter string to generate each of the plurality of child keys. 30.The computer-implemented method according to claim 29, wherein locationand length of the different portion of the original key and thecorresponding portion of the randomly generated character string can bedetermined based on a preset algorithm.
 31. A computer-implementedsystem, comprising: one or more computers; and one or more computermemory devices interoperably coupled with the one or more computers andhaving tangible, non-transitory, machine-readable media storing one ormore instructions that, when executed by the one or more computers,perform operations comprising: obtaining, by a server, an original keyassociated with a shared blockchain object; determining a first numberof parties sharing the original key, wherein the first number is atleast 2; and generating, by the server, a plurality of child keys basedon the original key by applying a predetermined algorithm to theoriginal key, wherein a total number of child keys equals the firstnumber of parties sharing the original key, wherein the plurality ofchild keys are collectively configured to enable reconstruction of theoriginal key.
 32. The computer-implemented system according to claim 31,wherein applying the predetermined algorithm comprises modifying theoriginal key based on a randomly generated character string.
 33. Thecomputer-implemented system according to claim 32, wherein modifying theoriginal key based on the randomly generated character string comprisesinserting one or more characters of the randomly generated characterstring in the original key to generate the child keys.
 34. Thecomputer-implemented system according to claim 31, wherein theoperations further comprise: sending, by the server, each child key ofthe plurality of child keys to a different corresponding party of thefirst number of parties sharing the original key; and deleting, by theserver, the original key.
 35. The computer-implemented system accordingto claim 34, wherein the operations further comprises restoring, by theserver, the deleted original key based on the plurality of child keys.36. The computer-implemented system according to claim 34, whereinrestoring the deleted original key based on the plurality of child keyscomprises using a reverse algorithm of the predetermined algorithm, aninterpolation algorithm, a correlation among the plurality of childkeys, or third-party auxiliary data.
 37. The computer-implemented systemaccording to claim 31, wherein the original key is generated by theserver or is received from a remote server.
 38. The computer-implementedsystem according to claim 32, wherein the randomly generated characterstring comprises one or more of: a numeral, a letter, and a symbol, andwherein the randomly generated character string is stored by the serverfor subsequent restoration of the original key.
 39. Thecomputer-implemented system according to claim 32, wherein generating,by the server, the plurality of child keys based on the original key byapplying the predetermined algorithm to the original key comprises:replacing a different portion of the original key with a correspondingportion of the randomly generated character string to generate each ofthe plurality of child keys.
 40. A non-transitory, computer-readablemedium storing one or more instructions executable by a computer systemto perform operations comprising: obtaining, by a server, an originalkey associated with a shared blockchain object; determining a firstnumber of parties sharing the original key, wherein the first number isat least 2; and generating, by the server, a plurality of child keysbased on the original key by applying a predetermined algorithm to theoriginal key, wherein a total number of child keys equals the firstnumber of parties sharing the original key, and wherein the plurality ofchild keys are collectively configured to enable reconstruction of theoriginal key.